Limits of Commutativity on Abstract Data Types
نویسندگان
چکیده
We present some formal properties of (symmetrical) commutativity, the major criterion used in transactional systems, which allow us to fully understand its advantages and disadvantages. The main result is that commutativity is subject to the same limitation as compatibility for arbitrary objects. However, commutativity has also a number of attracting properties, one of which is related to recovery and, to our knowledge, has not been exploited in the literature. Advantages and disadvantages are illustrated on abstract data types of interest. We also show how limits of commutativity have been circumvented, which gives guidelines for doing so (or not!).
منابع مشابه
A framework for designing concurrent and recoverable abstract data types based on commutativity
In this paper, we try to focus the reader's interest on the problems that transactional systems have to resolve for taking advantage of commutativity in a serializable and recoverable way. Our framework is, (as others), based on the use of conditional commutativity on abstract date types. We present new features that have not been found in the literature hitherto, that both increase concurrency...
متن کاملTuple-based abstract data types: full parallelism
Commutativity has the same inherent limitations as compatibility. Then, it is worth conceiving simple concurrency control techniques. We propose a restricted form of commutativity which increases parallelism without incurring a higher overhead than compatibility. Advantages of our proposition are: (1) commutativity of operations is determined at compile-time, (2) runtime checking is as efficien...
متن کاملThe Beta-Bernoulli process and algebraic effects
In this paper we analyze the Beta-Bernoulli process from Bayesian nonparametrics using the framework of algebraic effects from programming language theory. Our analysis reveals the importance of abstract data types, and two types of program equations, called commutativity and discardability, in the study of the Beta-Bernoulli process. We develop an equational theory of terms that use the Beta-B...
متن کاملA GENERALIZATION OF A JACOBSON’S COMMUTATIVITY THEOREM
In this paper we study the structure and the commutativity of a ring R, in which for each x,y ? R, there exist two integers depending on x,y such that [x,y]k equals x n or y n.
متن کاملMulti-diagrams of relations between fuzzy sets: weighted limits, colimits and commutativity
Limits and colimits of diagrams, defined by maps between sets, are universal constructions fundamental in different mathematical domains and key concepts in theoretical computer science. Its importance in semantic modeling is described by M. Makkai and R. Paré in [1], where it is formally shown that every axiomatizable theory in classical infinitary logic can be specified using diagrams defined...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1003.4830 شماره
صفحات -
تاریخ انتشار 2010